Domain-Free Pure Type Systems
نویسندگان
چکیده
Pure type systems make use of domain-full-abstractions x : D : M. We present a variant of pure type systems, which we call domain-free pure type systems, with domain-free-abstractions x : M. Domain-free pure type systems have a number of advantages over both pure type systems and so-called type assignment systems (they also have some disadvantages) and have been used in theoretical developments as well as in implementations of proof-assistants. We study the basic properties of domain-free pure type systems, establish their formal relationship with pure type systems and type assignment systems, and give a number of applications of these correspondences.
منابع مشابه
CPS Translations and Applications: The Cube and Beyond
Continuation passing style (CPS) translations of typed -calculi numerous applications. However, the range of these applications is con ned by the fact that CPS translations are known for nondependent type systems only, thus excluding well-known systems like the calculus of constructions (CC) and the logical frameworks (LF). This paper presents techniques for CPS translating systems with depende...
متن کاملOn the Role of Type Decorations in the Calculus of Inductive Constructions
In proof systems like Coq [15], proof-checking involves comparing types modulo β-conversion, which is potentially a time-consuming task. Significant speed-ups are achieved by compiling proof terms, see [8]. Since compilation erases some type information, we have to show that convertibility is preserved by type erasure. This article shows the equivalence of the Calculus of Inductive Construction...
متن کاملOn Positioned Eco-grammar Systems and Pure Grammars of Type 0
In this paper we extend our results given in [5] where we compared PEG systems with pure regulated context-free grammars (see [3]). We will show that the family of languages generated by the pure grammars of type 0 is a proper subclass of the family of languages generated by positioned eco-grammar systems. We present a way how to coordinate parallel behavior of agents with one-sided context in ...
متن کاملReviewing the Classical and the de Bruijn Notation for [lambda]-calculus and Pure Type Systems
This article is a brief review of the type-free -calculus and its basic rewriting notions, and of the pure type system framework which generalises many type systems. Both the type-free -calculus and the pure type systems are presented using variable names and de Bruijn indices. Using the presentation of the -calculus with de Bruijn indices, we illustrate how a calculus of explicit substitutions...
متن کاملPure Type Systems without Explicit Contexts
We present an approach to type theory in which the typing judgments do not have explicit contexts. Instead of judgments of shape Γ ` A : B, our systems just have judgments of shape A : B. A key feature is that we distinguish free and bound variables even in pseudo-terms. Specifically we give the rules of the ‘Pure Type System’ class of type theories in this style. We prove that the typing judgm...
متن کامل